On the extension problem for partial permutations
نویسندگان
چکیده
منابع مشابه
On the Extension Problem for Partial Permutations
A family of pseudovarieties of solvable groups is constructed, each of which has decidable membership and undecidable extension problem for partial permutations. Included are a pseudovariety U satisfying no non-trivial group identity and a metabelian pseudovariety Q. For each of these pseudovarieties V, the inverse monoid pseudovariety Sl∗V has undecidable membership problem. As a consequence, ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولon the goursat problem for a linear partial differential equation
in this paper, the goursat problem of a general form for a linear partial differential equation is investigated with the help of the riemann function method. some results are given concerning the existence and uniqueness for the solution of the suggested problem.
متن کاملAn Efficient Local Search for Partial Latin Square Extension Problem
A partial Latin square (PLS) is a partial assignment of n symbols to an n×n grid such that, in each row and in each column, each symbol appears at most once. The partial Latin square extension problem is an NP-hard problem that asks for a largest extension of a given PLS. In this paper we propose an efficient local search for this problem. We focus on the local search such that the neighborhood...
متن کاملIntersecting families of permutations and partial permutations
The above result motivated the study of intersecting families of permutations which was initiated by Deza and Frankl, see [2]. Let Sn be the symmetric group on [n], that is the group of all permutations of [n]. For a positive integer t, a subset A of Sn is said to be t-intersecting if, for any g, h ∈ A with g 6= h, we have |{x : g(x) = h(x)}| ≥ t. By an intersecting family, we mean an 1-interse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2003
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-03-06860-6